Path-oriented synchronized transit scheduling using time-dependent data

With the emergence of innovations associated with public transport (PT) services, such as Mobility-as-a-Service, demand responsive transit, and autonomous vehicles, door-to-door PT journey is achievable via multiple transfers between within different modes. As such, seamless modes transportation become an increasingly important factor for attractiveness services. At same time, recent developments in travel time prediction methodologies offer new, reliable data sources optimization operations. This work, consideration these two elements, develops a mixed integer linear programming model schedule synchronization problem. The novelty threefold. First, novel concept path-oriented scheduling proposed. path transfer explicitly formulated minimized to provide experience considering that emerging multimodal mobility inevitably induces transfers. Second, time-dependent also utilized model, which allows us harness new more representative improving Third, order complement increase computational complexity result utilization data, three valid inequalities (VIs) are derived. Numerical studies show use beneficial terms reducing times, when compared using mean historical times. numerical study reveals tradeoff maximum allowable trip time. Using simulation on bus lines Copenhagen, we demonstrate could reduce computation by 8.5% average, where reduction reach 54.0%. proposed benchmarked against classes literature. It found outperform those We further improvement performance can be attained combination inequalities.